D-optimal orthogonal array minus t run designs
نویسندگان
چکیده
منابع مشابه
Optimal orthogonal-array-based latin hypercubes
The use of optimal orthogonal array latin hypercube designs is proposed. Orthogonal arrays were proposed for constructing latin hypercube designs by Tang (1993). Such designs generally have better space filling properties than random latin hypercube designs. Even so, these designs do not necessarily fill the space particularly well. As a result, we consider orthogonal-array-based latin...
متن کاملSome new D-optimal designs
We construct several new (v; r, 8; A) supplementary difference sets with v odd and T' + .5 = A + (v 1) /2. They give rise to D-optimal designs of order 2v. D-optimal designs of orders 158, 194, and 290 are constructed here for the first time. We also give an up to date survey of this class of supplementary difference sets in arbitrary Abelian groups of odd order v < 100. o. Introduction Supplem...
متن کاملMarginally restricted sequential D-optimal designs
In many experiments, not all explanatory variables can be controlled. When the units arise sequentially, different approaches may be used. The authors study a natural sequential procedure for “marginally restricted” D-optimal designs. They assume that one set of explanatory variables (x1) is observed sequentially, and that the experimenter responds by choosing an appropriate value of the explan...
متن کاملD-optimal designs via a cocktail algorithm
A fast new algorithm is proposed for numerical computation of (approximate) D-optimal designs. This cocktail algorithm extends the well-known vertex direction method (VDM; Fedorov 1972) and the multiplicative algorithm (Silvey, Titterington and Torsney, 1978), and shares their simplicity and monotonic convergence properties. Numerical examples show that the cocktail algorithm can lead to dramat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Theory and Practice
سال: 2018
ISSN: 1559-8608,1559-8616
DOI: 10.1080/15598608.2018.1441081